The target visitation arc routing problem

This paper studies the target visitation arc routing problem on an undirected graph. combines well-known rural postman and linear ordering problem. In this problem, there is a set of required edges partitioned into targets, which must be traversed are pairwise preferences for order in some targets serviced, generates revenue if preference satisfied. The aim to find tour that traverses all at least once, offers compromise between generated by cost tour. A integer programming formulation including families valid inequalities proposed. Despite difficulty model can used solve optimality around 62% test instances.